Efficient counting of models for boolean formulas represented by embedded cycles
نویسندگان
چکیده
To compute the number of models of a 2-CF (conjunction of clauses with two literals at most), the well-known problem as #2-SAT, is a classical #P-complete problem. We show here an extensive class of instances of 2CF’s where to compute the number of models can be done
منابع مشابه
Model Counting for 2SAT Based on Graphs by Matrix Operators
Counting the models of Boolean formulae is known to be intractable but pops up often in diverse areas. We focus in a restricted version of the problem. In particular, our results are based on matrix operators and Hadamard product for counting models of Boolean formulae consisting of chains and embedded cycles. We obtain an efficient algorithm such that the input is a Boolean formula Σ in 2-CNF ...
متن کاملA Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas
In this paper, we focus on exact, deterministic algorithms for computing the number of models in Boolean formulas in Two Conjuntive Form (2-CF), denoted as #2-SAT problem. We present a series of linear procedures which when they are integrated into a main program, allow us to compute in polynomial time the number of models of a formula F in 2-CF when the constraint graph GF holds the following ...
متن کاملNew Polynomial Classes for #2SAT Established Via Graph-Topological Structure
We address the problem of designing efficient procedures for counting models of Boolean formulas and, in this task, we establish new classes of instances where #2SAT is solved in polynomial time. Those instances are recognized by the topological structure of the underlying graph of the instances. We show that, if the depth-search over the constrained graph of a formula generates a tree where th...
متن کاملConteo de Modelos en la Clase Sintáctica 2mu-3MON
The counting model problem in Boolean formulas is #P-complete, i.e., there is no known deterministic algorithm in the classical computability model (Turing machine) that makes this count in polynomial time. The difficulty persists even imposing more restrictive conditions on the syntactic classes of Boolean formulas. In this paper we present a treatable family within the syntactical class 2μ-3M...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کامل